On reconstruction of signed permutations distorted by reversal errors

نویسنده

  • Elena V. Konstantinova
چکیده

The problem of reconstructing signed permutations on n elements from their erroneous patterns distorted by reversal errors is considered in this paper.A reversal is the operation of taking a segment of the signed permutation, reversing it, and flipping the signs of its elements. The reversal metric is defined as the least number of reversals transforming one signed permutation into another. It is proved that for any n 2 an arbitrary signed permutation is uniquely reconstructible from three distinct signed permutations at reversal distance at most one from the signed permutation. The proposed approach is based on the investigation of structural properties of a Cayley graphG2n whose vertices form a subgroup of the symmetric group Sym2n. It is also proved that an arbitrary signed permutation is reconstructible from two distinct signed permutations with probability p2 ∼ 3 as n → ∞. In the case of at most two reversal errors it is shown that at least n(n+ 1) distinct erroneous patterns are required in order to reconstruct an arbitrary signed permutation. © 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of permutations distorted by single transposition errors

The reconstruction problem for permutations on n elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any n ≥ 3 an unknown permutation is uniquely reconstructible from 4 distinct permutations at transposition distance at most one from the unknown permutation. The transposition distance between two permutations is defined a...

متن کامل

A simple framework on sorting permutations

In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange dis...

متن کامل

On the expectation and variance of the reversal distance.

We give a pair of well-matched lower and upper bounds for the expectation of reversal distance under the hypothesis of random gene order by investigating the expected number of cycles in the breakpoint graph of linear signed permutations. Sankoff and Haque [9] proved similar results for circular signed permutations based on approximations based on a slightly different model; while our approach ...

متن کامل

Perfect Sorting by Reversal is not Always Difficult

This paper investigates the problem of conservation of combinatorial structures in genome rearrangement scenarios. We characterize a class of signed permutations for which one can compute in polynomial time a reversal scenario that conserves all common intervals, and that is parsimonious among such scenarios. The general problem is believed to be NP-hard. We show that there exists a class of pe...

متن کامل

Estimating Genome Reversal Distance by Genetic Algorithm

Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-hard. The best guaranteed error bounded is the 3/2approximation algorithm. However, the problem of sorting signed permutation can be solved easily. Fast algorithms have been developed both for finding the sorting sequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 308  شماره 

صفحات  -

تاریخ انتشار 2008